A dual form of Erdös-Rado's canonization theorem

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Dual Form of Ramsey’s Theorem

Let k E w, where w is the set of all natural numbers. Ramsey’s Theorem deals with colorings of the k-element subsets of w. Our dual form deals with colorings of the k-element partitions of w. Let (o)lr (respectively (w)“) be the set of all partitions of w having exactly k (respectively infinitely many) blocks. Given X E (w)” let (X)k be the set of all YE (w)” such that Y is coarser than X. Dual...

متن کامل

Analytic Erdös-Turán conjectures and Erdös-Fuchs theorem

We consider and study formal power series, that we call supported series, with real coefficients which are either zero or bounded below by some positive constant. The sequences of such coefficients have a lot of similarity with sequences of natural numbers considered in additive number theory. It is this analogy that we pursue, thus establishing many properties and giving equivalent statements ...

متن کامل

A Weighted Erdös-Ginzburg-Ziv Theorem

An n-set partition of a sequence S is a collection of n nonempty subsequences of S, pairwise disjoint as sequences, such that every term of S belongs to exactly one of the subsequences, and the terms in each subsequence are all distinct so that they can be considered as sets. If S is a sequence of m+ n− 1 elements from a finite abelian group G of order m and exponent k, and if W = {wi}i=1 is a ...

متن کامل

A remark on the Erdös-Szekeres theorem

The Erdős–Szekeres theorem states that for any , any sufficiently large set of points in general position in the plane contains points in convex position. We show that for any and any finite sequence ! ! #" , with #$% & ( ')(+*, ! ! ), any sufficiently large set of points in general position in the plane contains either an empty convex ) gon or convex polygons . ! ! /. " , where 0 . $ 0,(& $ an...

متن کامل

A note on a theorem of Erdös & Gallai

We show that the Erdos-Gallai condition characterizing graphical degree sequences of length p needs to be checked only for as many n as there are distinct terms in the sequence, not all n, 1 6 n 6 p. MSC: 05 C07

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 1986

ISSN: 0097-3165

DOI: 10.1016/0097-3165(86)90087-7